LIPIcs - Leibniz International Proceedings in Informatics. 26th International Conference on Concurrency Theory (CONCUR 2015)
Publication date
01/01/2015
Field of study
We consider weighted automata with both positive and negative integer weights on edges and study the problem of synchronization using adaptive strategies that may only observe whether the current weight-level is negative or nonnegative. We show that the synchronization problem is decidable in polynomial time for deterministic weighted automata